Termination w.r.t. Q of the following Term Rewriting System could not be shown:
Q restricted rewrite system:
The TRS R consists of the following rules:
a(x1) → x1
a(b(x1)) → a(c(b(b(c(x1)))))
b(x1) → x1
c(c(x1)) → a(x1)
Q is empty.
↳ QTRS
↳ DependencyPairsProof
↳ QTRS Reverse
↳ QTRS Reverse
Q restricted rewrite system:
The TRS R consists of the following rules:
a(x1) → x1
a(b(x1)) → a(c(b(b(c(x1)))))
b(x1) → x1
c(c(x1)) → a(x1)
Q is empty.
Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:
A(b(x1)) → B(b(c(x1)))
A(b(x1)) → B(c(x1))
C(c(x1)) → A(x1)
A(b(x1)) → A(c(b(b(c(x1)))))
A(b(x1)) → C(b(b(c(x1))))
A(b(x1)) → C(x1)
The TRS R consists of the following rules:
a(x1) → x1
a(b(x1)) → a(c(b(b(c(x1)))))
b(x1) → x1
c(c(x1)) → a(x1)
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
A(b(x1)) → B(b(c(x1)))
A(b(x1)) → B(c(x1))
C(c(x1)) → A(x1)
A(b(x1)) → A(c(b(b(c(x1)))))
A(b(x1)) → C(b(b(c(x1))))
A(b(x1)) → C(x1)
The TRS R consists of the following rules:
a(x1) → x1
a(b(x1)) → a(c(b(b(c(x1)))))
b(x1) → x1
c(c(x1)) → a(x1)
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 2 less nodes.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
C(c(x1)) → A(x1)
A(b(x1)) → A(c(b(b(c(x1)))))
A(b(x1)) → C(b(b(c(x1))))
A(b(x1)) → C(x1)
The TRS R consists of the following rules:
a(x1) → x1
a(b(x1)) → a(c(b(b(c(x1)))))
b(x1) → x1
c(c(x1)) → a(x1)
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule A(b(x1)) → C(b(b(c(x1)))) at position [0] we obtained the following new rules:
A(b(c(x0))) → C(b(b(a(x0))))
A(b(y0)) → C(b(c(y0)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
C(c(x1)) → A(x1)
A(b(y0)) → C(b(c(y0)))
A(b(x1)) → A(c(b(b(c(x1)))))
A(b(x1)) → C(x1)
A(b(c(x0))) → C(b(b(a(x0))))
The TRS R consists of the following rules:
a(x1) → x1
a(b(x1)) → a(c(b(b(c(x1)))))
b(x1) → x1
c(c(x1)) → a(x1)
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule A(b(x1)) → A(c(b(b(c(x1))))) at position [0] we obtained the following new rules:
A(b(y0)) → A(c(b(c(y0))))
A(b(c(x0))) → A(c(b(b(a(x0)))))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
A(b(y0)) → A(c(b(c(y0))))
C(c(x1)) → A(x1)
A(b(y0)) → C(b(c(y0)))
A(b(c(x0))) → A(c(b(b(a(x0)))))
A(b(x1)) → C(x1)
A(b(c(x0))) → C(b(b(a(x0))))
The TRS R consists of the following rules:
a(x1) → x1
a(b(x1)) → a(c(b(b(c(x1)))))
b(x1) → x1
c(c(x1)) → a(x1)
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The finiteness of this DP problem is implied by strong termination of a SRS due to [12].
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q restricted rewrite system:
The TRS R consists of the following rules:
a(x1) → x1
a(b(x1)) → a(c(b(b(c(x1)))))
b(x1) → x1
c(c(x1)) → a(x1)
A(b(y0)) → A(c(b(c(y0))))
C(c(x1)) → A(x1)
A(b(y0)) → C(b(c(y0)))
A(b(c(x0))) → A(c(b(b(a(x0)))))
A(b(x1)) → C(x1)
A(b(c(x0))) → C(b(b(a(x0))))
Q is empty.
We have reversed the following QTRS:
The set of rules R is
a(x1) → x1
a(b(x1)) → a(c(b(b(c(x1)))))
b(x1) → x1
c(c(x1)) → a(x1)
A(b(y0)) → A(c(b(c(y0))))
C(c(x1)) → A(x1)
A(b(y0)) → C(b(c(y0)))
A(b(c(x0))) → A(c(b(b(a(x0)))))
A(b(x1)) → C(x1)
A(b(c(x0))) → C(b(b(a(x0))))
The set Q is empty.
We have obtained the following QTRS:
a(x) → x
b(a(x)) → c(b(b(c(a(x)))))
b(x) → x
c(c(x)) → a(x)
b(A(x)) → c(b(c(A(x))))
c(C(x)) → A(x)
b(A(x)) → c(b(C(x)))
c(b(A(x))) → a(b(b(c(A(x)))))
b(A(x)) → C(x)
c(b(A(x))) → a(b(b(C(x))))
The set Q is empty.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ QTRS Reverse
↳ DependencyPairsProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q restricted rewrite system:
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → c(b(b(c(a(x)))))
b(x) → x
c(c(x)) → a(x)
b(A(x)) → c(b(c(A(x))))
c(C(x)) → A(x)
b(A(x)) → c(b(C(x)))
c(b(A(x))) → a(b(b(c(A(x)))))
b(A(x)) → C(x)
c(b(A(x))) → a(b(b(C(x))))
Q is empty.
We have reversed the following QTRS:
The set of rules R is
a(x) → x
b(a(x)) → c(b(b(c(a(x)))))
b(x) → x
c(c(x)) → a(x)
b(A(x)) → c(b(c(A(x))))
c(C(x)) → A(x)
b(A(x)) → c(b(C(x)))
c(b(A(x))) → a(b(b(c(A(x)))))
b(A(x)) → C(x)
c(b(A(x))) → a(b(b(C(x))))
The set Q is empty.
We have obtained the following QTRS:
a(x) → x
a(b(x)) → a(c(b(b(c(x)))))
b(x) → x
c(c(x)) → a(x)
A(b(x)) → A(c(b(c(x))))
C(c(x)) → A(x)
A(b(x)) → C(b(c(x)))
A(b(c(x))) → A(c(b(b(a(x)))))
A(b(x)) → C(x)
A(b(c(x))) → C(b(b(a(x))))
The set Q is empty.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q restricted rewrite system:
The TRS R consists of the following rules:
a(x) → x
a(b(x)) → a(c(b(b(c(x)))))
b(x) → x
c(c(x)) → a(x)
A(b(x)) → A(c(b(c(x))))
C(c(x)) → A(x)
A(b(x)) → C(b(c(x)))
A(b(c(x))) → A(c(b(b(a(x)))))
A(b(x)) → C(x)
A(b(c(x))) → C(b(b(a(x))))
Q is empty.
Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:
B(A(x)) → C1(b(c(A(x))))
B(a(x)) → C1(a(x))
C1(b(A(x))) → A1(b(b(c(A(x)))))
B(a(x)) → C1(b(b(c(a(x)))))
C1(b(A(x))) → A1(b(b(C(x))))
C1(c(x)) → A1(x)
B(A(x)) → B(c(A(x)))
C1(b(A(x))) → B(b(C(x)))
B(A(x)) → C1(A(x))
B(a(x)) → B(b(c(a(x))))
B(a(x)) → B(c(a(x)))
B(A(x)) → B(C(x))
C1(b(A(x))) → C1(A(x))
C1(b(A(x))) → B(c(A(x)))
B(A(x)) → C1(b(C(x)))
C1(b(A(x))) → B(b(c(A(x))))
C1(b(A(x))) → B(C(x))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → c(b(b(c(a(x)))))
b(x) → x
c(c(x)) → a(x)
b(A(x)) → c(b(c(A(x))))
c(C(x)) → A(x)
b(A(x)) → c(b(C(x)))
c(b(A(x))) → a(b(b(c(A(x)))))
b(A(x)) → C(x)
c(b(A(x))) → a(b(b(C(x))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ QTRS Reverse
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(A(x)) → C1(b(c(A(x))))
B(a(x)) → C1(a(x))
C1(b(A(x))) → A1(b(b(c(A(x)))))
B(a(x)) → C1(b(b(c(a(x)))))
C1(b(A(x))) → A1(b(b(C(x))))
C1(c(x)) → A1(x)
B(A(x)) → B(c(A(x)))
C1(b(A(x))) → B(b(C(x)))
B(A(x)) → C1(A(x))
B(a(x)) → B(b(c(a(x))))
B(a(x)) → B(c(a(x)))
B(A(x)) → B(C(x))
C1(b(A(x))) → C1(A(x))
C1(b(A(x))) → B(c(A(x)))
B(A(x)) → C1(b(C(x)))
C1(b(A(x))) → B(b(c(A(x))))
C1(b(A(x))) → B(C(x))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → c(b(b(c(a(x)))))
b(x) → x
c(c(x)) → a(x)
b(A(x)) → c(b(c(A(x))))
c(C(x)) → A(x)
b(A(x)) → c(b(C(x)))
c(b(A(x))) → a(b(b(c(A(x)))))
b(A(x)) → C(x)
c(b(A(x))) → a(b(b(C(x))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 9 less nodes.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ QTRS Reverse
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(x)) → B(c(a(x)))
B(a(x)) → B(b(c(a(x))))
B(A(x)) → C1(b(c(A(x))))
B(a(x)) → C1(a(x))
B(A(x)) → C1(b(C(x)))
B(a(x)) → C1(b(b(c(a(x)))))
C1(b(A(x))) → B(b(c(A(x))))
C1(b(A(x))) → B(b(C(x)))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → c(b(b(c(a(x)))))
b(x) → x
c(c(x)) → a(x)
b(A(x)) → c(b(c(A(x))))
c(C(x)) → A(x)
b(A(x)) → c(b(C(x)))
c(b(A(x))) → a(b(b(c(A(x)))))
b(A(x)) → C(x)
c(b(A(x))) → a(b(b(C(x))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule C1(b(A(x))) → B(b(c(A(x)))) at position [0] we obtained the following new rules:
C1(b(A(y0))) → B(c(A(y0)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ QTRS Reverse
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(x)) → B(b(c(a(x))))
B(a(x)) → B(c(a(x)))
C1(b(A(y0))) → B(c(A(y0)))
B(A(x)) → C1(b(c(A(x))))
B(a(x)) → C1(a(x))
B(a(x)) → C1(b(b(c(a(x)))))
B(A(x)) → C1(b(C(x)))
C1(b(A(x))) → B(b(C(x)))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → c(b(b(c(a(x)))))
b(x) → x
c(c(x)) → a(x)
b(A(x)) → c(b(c(A(x))))
c(C(x)) → A(x)
b(A(x)) → c(b(C(x)))
c(b(A(x))) → a(b(b(c(A(x)))))
b(A(x)) → C(x)
c(b(A(x))) → a(b(b(C(x))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ QTRS Reverse
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(x)) → B(c(a(x)))
B(a(x)) → B(b(c(a(x))))
B(A(x)) → C1(b(c(A(x))))
B(a(x)) → C1(a(x))
B(A(x)) → C1(b(C(x)))
B(a(x)) → C1(b(b(c(a(x)))))
C1(b(A(x))) → B(b(C(x)))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → c(b(b(c(a(x)))))
b(x) → x
c(c(x)) → a(x)
b(A(x)) → c(b(c(A(x))))
c(C(x)) → A(x)
b(A(x)) → c(b(C(x)))
c(b(A(x))) → a(b(b(c(A(x)))))
b(A(x)) → C(x)
c(b(A(x))) → a(b(b(C(x))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule C1(b(A(x))) → B(b(C(x))) at position [0] we obtained the following new rules:
C1(b(A(y0))) → B(C(y0))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ QTRS Reverse
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(x)) → B(b(c(a(x))))
B(a(x)) → B(c(a(x)))
B(A(x)) → C1(b(c(A(x))))
B(a(x)) → C1(a(x))
B(a(x)) → C1(b(b(c(a(x)))))
B(A(x)) → C1(b(C(x)))
C1(b(A(y0))) → B(C(y0))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → c(b(b(c(a(x)))))
b(x) → x
c(c(x)) → a(x)
b(A(x)) → c(b(c(A(x))))
c(C(x)) → A(x)
b(A(x)) → c(b(C(x)))
c(b(A(x))) → a(b(b(c(A(x)))))
b(A(x)) → C(x)
c(b(A(x))) → a(b(b(C(x))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 5 less nodes.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ QTRS Reverse
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(x)) → B(b(c(a(x))))
B(a(x)) → B(c(a(x)))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → c(b(b(c(a(x)))))
b(x) → x
c(c(x)) → a(x)
b(A(x)) → c(b(c(A(x))))
c(C(x)) → A(x)
b(A(x)) → c(b(C(x)))
c(b(A(x))) → a(b(b(c(A(x)))))
b(A(x)) → C(x)
c(b(A(x))) → a(b(b(C(x))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(a(x)) → B(c(a(x))) at position [0] we obtained the following new rules:
B(a(x0)) → B(c(x0))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ QTRS Reverse
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(x)) → B(b(c(a(x))))
B(a(x0)) → B(c(x0))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → c(b(b(c(a(x)))))
b(x) → x
c(c(x)) → a(x)
b(A(x)) → c(b(c(A(x))))
c(C(x)) → A(x)
b(A(x)) → c(b(C(x)))
c(b(A(x))) → a(b(b(c(A(x)))))
b(A(x)) → C(x)
c(b(A(x))) → a(b(b(C(x))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(a(x)) → B(b(c(a(x)))) at position [0] we obtained the following new rules:
B(a(y0)) → B(c(a(y0)))
B(a(x0)) → B(b(c(x0)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ QTRS Reverse
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(y0)) → B(c(a(y0)))
B(a(x0)) → B(b(c(x0)))
B(a(x0)) → B(c(x0))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → c(b(b(c(a(x)))))
b(x) → x
c(c(x)) → a(x)
b(A(x)) → c(b(c(A(x))))
c(C(x)) → A(x)
b(A(x)) → c(b(C(x)))
c(b(A(x))) → a(b(b(c(A(x)))))
b(A(x)) → C(x)
c(b(A(x))) → a(b(b(C(x))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(a(y0)) → B(c(a(y0))) at position [0] we obtained the following new rules:
B(a(x0)) → B(c(x0))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ QTRS Reverse
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(x0)) → B(b(c(x0)))
B(a(x0)) → B(c(x0))
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → c(b(b(c(a(x)))))
b(x) → x
c(c(x)) → a(x)
b(A(x)) → c(b(c(A(x))))
c(C(x)) → A(x)
b(A(x)) → c(b(C(x)))
c(b(A(x))) → a(b(b(c(A(x)))))
b(A(x)) → C(x)
c(b(A(x))) → a(b(b(C(x))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We have reversed the following QTRS:
The set of rules R is
a(x) → x
b(a(x)) → c(b(b(c(a(x)))))
b(x) → x
c(c(x)) → a(x)
b(A(x)) → c(b(c(A(x))))
c(C(x)) → A(x)
b(A(x)) → c(b(C(x)))
c(b(A(x))) → a(b(b(c(A(x)))))
b(A(x)) → C(x)
c(b(A(x))) → a(b(b(C(x))))
The set Q is empty.
We have obtained the following QTRS:
a(x) → x
a(b(x)) → a(c(b(b(c(x)))))
b(x) → x
c(c(x)) → a(x)
A(b(x)) → A(c(b(c(x))))
C(c(x)) → A(x)
A(b(x)) → C(b(c(x)))
A(b(c(x))) → A(c(b(b(a(x)))))
A(b(x)) → C(x)
A(b(c(x))) → C(b(b(a(x))))
The set Q is empty.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ QTRS Reverse
↳ DependencyPairsProof
↳ QTRS Reverse
↳ QTRS
↳ QTRS Reverse
↳ QTRS Reverse
Q restricted rewrite system:
The TRS R consists of the following rules:
a(x) → x
a(b(x)) → a(c(b(b(c(x)))))
b(x) → x
c(c(x)) → a(x)
A(b(x)) → A(c(b(c(x))))
C(c(x)) → A(x)
A(b(x)) → C(b(c(x)))
A(b(c(x))) → A(c(b(b(a(x)))))
A(b(x)) → C(x)
A(b(c(x))) → C(b(b(a(x))))
Q is empty.
We have reversed the following QTRS:
The set of rules R is
a(x1) → x1
a(b(x1)) → a(c(b(b(c(x1)))))
b(x1) → x1
c(c(x1)) → a(x1)
The set Q is empty.
We have obtained the following QTRS:
a(x) → x
b(a(x)) → c(b(b(c(a(x)))))
b(x) → x
c(c(x)) → a(x)
The set Q is empty.
↳ QTRS
↳ DependencyPairsProof
↳ QTRS Reverse
↳ QTRS
↳ QTRS Reverse
Q restricted rewrite system:
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → c(b(b(c(a(x)))))
b(x) → x
c(c(x)) → a(x)
Q is empty.
We have reversed the following QTRS:
The set of rules R is
a(x1) → x1
a(b(x1)) → a(c(b(b(c(x1)))))
b(x1) → x1
c(c(x1)) → a(x1)
The set Q is empty.
We have obtained the following QTRS:
a(x) → x
b(a(x)) → c(b(b(c(a(x)))))
b(x) → x
c(c(x)) → a(x)
The set Q is empty.
↳ QTRS
↳ DependencyPairsProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS
Q restricted rewrite system:
The TRS R consists of the following rules:
a(x) → x
b(a(x)) → c(b(b(c(a(x)))))
b(x) → x
c(c(x)) → a(x)
Q is empty.